Alternating cycles and paths in edge-coloured multigraphs: A survey
نویسندگان
چکیده
A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs. We also show useful connections between the theory of paths and cycles in bipartite digraphs and the theory of alternating paths and cycles in edge-coloured graphs.
منابع مشابه
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M be a 2-edge-coloured complete multigraph. M. Bankfalvi and Zs. Bankfalvi [2] obtained a necessary and sufficient condition for G to have a Hamiltonian alternating cycle. Generalizing this theorem, P. Das and S.B. Rao [7]...
متن کاملProperly Coloured Cycles and Paths: Results and Open Problems
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of transformations of an edge-coloured multigraph G into an ordinary graph that allow us to check the existence of PC cycles and PC (s, t)-paths in G and, if they exist, ...
متن کاملGadget Graphs for Edge-coloured Graphs
In this paper, we consider properly edge-coloured (PC) paths and cycles in edge-coloured graphs. We consider a family of transformations of an edge-coloured graph G into an ordinary graph that allow us to check the existence PC cycles and PC (s, t)-paths in G and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible so...
متن کاملA Note on Alternating Cycles in Edge-Coloured Graphs
Grossman and HH aggkvist gave a characterisation of two-edge-coloured graphs, which have an alternating cycle (i.e. a cycle in which no two consecutive edges have the same colour). We extend their characterisa-tion to edge-coloured graphs, with any number of colours. That is we show that if there is no alternating cycle in an edge-coloured graph, G, then it contains a vertex z, such that there ...
متن کاملCycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum colored degree greater than or equal to d 2 e has properly edge-colored cycles of all possible lengths, including hamiltonian c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 165-166 شماره
صفحات -
تاریخ انتشار 1997